An Algorithm for Parallel Sn Sweeps on Unstructured Meshes
نویسنده
چکیده
We develop a new algorithm for performing parallel Sn sweeps on unstructured meshes. The algorithm uses a low-complexity list ordering heuristic to determine a sweep ordering on any partitioned mesh. For typical problems and with \normal" mesh partitionings we have observed nearly linear speedups on up to 126 processors. This is an important and desirable result, since although analyses of structured meshes indicate that parallel sweeps will not scale with normal partitioning approaches, we do not observe any severe asymptotic degradation in the parallel eÆciency with modest ( 100) levels of parallelism. This work is a fundamental step in the development of parallel Sn methods.
منابع مشابه
JSweep: A Patch-centric Data-driven Approach for Parallel Sweeps on Large-scale Meshes
In mesh-based numerical simulations, sweep is an important computation pattern. During sweeping a mesh, computations on cells are strictly ordered by data dependencies in given directions. Due to such a serial order, parallelizing sweep is challenging, especially for unstructured and deforming structured meshes. Meanwhile, recent high-fidelity multi-physics simulations of particle transport, in...
متن کاملParallel Sn Sweeps on Unstructured Grids: Algorithms for Prioritization, Grid Partitioning, and Cycle Detection
The method of discrete ordinates is commonly used to solve the Boltzmann transport equation. The solution in each ordinate direction is most efficiently computed by sweeping the radiation flux across the computational grid. For unstructured grids this poses many challenges, particularly when implemented on distributed-memory parallel machines where the grid geometry is spread across processors....
متن کاملImplementation of a Cell-wise Block-gauss-seidel Iterative Method for Sn Transport on a Hybrid Parallel Computer Architecture
We have implemented a cell-wise, block-Gauss-Seidel (bGS) iterative algorithm, for the solution of the Sn transport equations on the Roadrunner hybrid, parallel computer architecture. A compute node of this massively parallel machine comprises AMD Opteron cores that are linked to a Cell Broadband Engine (Cell/B.E.). LAPACK routines have been ported to the Cell/B.E. in order to make use of its p...
متن کاملParallel Refinement of Unstructured Meshes
In this paper we describe a parallel h-refinement algorithm for unstructured finite element meshes based on the longest-edge bisection of triangles and tetrahedrons. This algorithm is implemented in PARED, a system that supports the parallel adaptive solution of PDEs. We discuss the design of such an algorithm for distributed memory machines including the problem of propagating refinement acros...
متن کاملParallel Dynamic Graph Partitioning for Adaptive Unstructured Meshes
A parallel method for the dynamic partitioning of unstructured meshes is described. The method introduces a new iterative optimization technique known as relative gain optimization which both balances the workload and attempts to minimize the interprocessor communications overhead. Experiments on a series of adaptively refined meshes indicate that the algorithm provides partitions of an equival...
متن کامل